Formalization of Variables in Algebraic High-Level Nets: Comparison of Di erent Approaches
نویسندگان
چکیده
The paper discusses diierent approaches to formalize the representation of variables in Algebraic High-Level nets (AHL nets). We compare the approaches formally with regard to certain quality conditions a good AHL net formalization should satisfy. These quality conditions are (1) the cocompleteness of the underlying category of AHL nets and AHL net morphisms as this is the technical basis for the formaliza-tion of structuring techniques for AHL nets; (2) the preservation of the net's ring behaviour by AHL net morphisms; (3) the possibility to rename variables via AHL net morphisms. An example shows that the usual treatment of variables as part of the algebraic speciication leads to a violation of these quality conditions. Then, diierent formal approaches are introduced to solve the problems. The approach we regard as the best solution of our problems, is based on local transition variables deening local name scopes for the variables of each transition. We present a concrete and an abstract, categorical formalization of this approach.
منابع مشابه
Speci cations and Solution Techniques for Non-Markovian Stochastic Petri Nets
Allmost all the available tools for the analysis of Stochastic Petri Nets (SPN) assume that the stochastic nature of the problem is restricted to be a Continuous Time Markov Chain (CTMC), but in reality, there are instances in which the CTMC assumption is too weak. The evolution of the stochastic systems with nonexponential timing becomes a stochastic process, for which in general, no analytica...
متن کاملParallel Approaches to the Numerical Transient Analysis of Stochastic Reward Nets
This paper presents parallel approaches to the complete tran sient numerical analysis of stochastic reward nets SRNs for both shared and distributed memory machines Parallelization concepts and imple mentation issues are discussed for the three main analysis steps that are generation of the underlying continuous time Markov chain CTMC solving the CTMC numerically for the desired time points and...
متن کاملRONs Revisited: General Approach to Model Reconfigurable Object Nets based on Algebraic High-Level Nets
Reconfigurable Object Nets (RONs) have been implemented in our group to support the visual specification of controlled rule-based transformations of marked place/transition (P/T) nets. RONs are high-level nets (system nets) with two types of tokens: object nets (P/T nets) and net transformation rules. System net transitions can be of different types to fire object net transitions, move object n...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملRelating Two State Feedback H1 Control Approaches
In this paper, two di erent approaches to the H1 control by state feedback are related and discussed. The rst approach is based on the solvability of an algebraic Riccati equation and the second one explores the convexity of the set de ned by a matrix inequality. New insights are provided in order to establish the relationship between the set of stabilizing gains obtained from the two di erent ...
متن کامل